0/1-Integer Programming: Optimization and Augmentation are Equivalent
نویسندگان
چکیده
For every fixed set F ⊆ {0, 1}n the following problems are strongly polynomial time equivalent: given a feasible point x ∈ F and a linear objective function c ∈ ZZn, • find a feasible point x∗ ∈ F that maximizes cx (Optimization), • find a feasible point x ∈ F with cx > cx (Augmentation), and • find a feasible point x ∈ F with cx > cx such that x − x is “irreducible” (Irreducible Augmentation). This generalizes results and techniques that are well known for 0/1–integer programming problems that arise from various classes of combinatorial optimization problems.
منابع مشابه
Fachbereich 3 Mathematik Optimization and Augmentation Are Equivalent Optimization and Augmentation Are Equivalent
For every family of sets F f0; 1g n the following problems are strongly polynomial time equivalent: given a feasible point x 0 2 F and a linear objective function c 2 Z Z n , nd a feasible point x 2 F that maximizes c x (Optimization), nd a feasible point x new 2 F with c x new > c x 0 (Augmentation), and nd a feasible point x new 2 F with c x new > c x 0 such that x new ? x 0 is \irreducible" ...
متن کاملInteger Programming: Optimization and Evaluation Are Equivalent
We show that if one can find the optimal value of an integer linear programming problem in polynomial time, then one can find an optimal solution in polynomial time. We also present a proper generalization to (general) integer programs and to local search problems of the well-known result that optimization and augmentation are equivalent for 0/1-integer programs. Among other things, our results...
متن کاملFew heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem
This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...
متن کاملOn the Relative Complexity of 15 Problems Related to 0/1-Integer Programming
An integral part of combinatorial optimization and computational complexity consists of establishing relationships between different problems or different versions of the same problem. In this chapter, we bring together known and new, previously published and unpublished results, which establish that 15 problems related to optimizing a linear function over a 0/1-polytope are polynomial-time equ...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کامل